Distributed Constraint-Based Railway Simulation
نویسنده
چکیده
In railway simulation, given timetables have to be checked against various criteria, mainly correctness and robustness. Most existing approaches use classical centralized simulation techniques. This work goes beyond that in two main aspects: We use constraint satisfaction to get rid of dead lock problems and the simulation is done distributed for better performance. This should make it possible to solve very large railway simulation problems.
منابع مشابه
Verteilte Constraint-basierte Eisenbahn-Simulation
This work designs and evaluates a new algorithm for the simulation of railway systems: Distributed Railway Simulation (DRS). DRS is a distributed meta-al gorithm, that conducts local, constraint-based simulators, to cooperatively com pute a global simulation. For the analysis of complex real-world systems, often simulation approaches are used. Railway companies, like the German Deutsche Bahn ...
متن کاملDomain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, many problems are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subproblems. Nevertheless, general distributed techniques are not always approp...
متن کاملDistributed constraint satisfaction problems to model railway scheduling problems
Railway Scheduling is considered to be a difficult and time-consuming task. Despite real railway networks being modelled as Constraint Satisfaction Problems (CSPs), they require a huge number of variables and constraints. The general CSP is known to be NP-complete; however, distributed models may reduce the exponential complexity by dividing the problem into a set of subproblems. In this work, ...
متن کاملDomain - dependent distributed models for railway scheduling q
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, many problems are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subproblems. Nevertheless, general distributed techniques are not always approp...
متن کاملApplication of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem∗
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be more easily solved. In this work, we present a distributed model for solving large-scale CSPs. Our ...
متن کامل